Greedy algorithm for local heating problem

This paper studies a planning problem for heating water. Hereby, boilers (e.g. gas or electric boilers, heat pumps microCHPs) are used to the water and store it domestic demands. We consider simple boiler which is either turned on off has buffer of limited capacity. The energy needed run be bought day-ahead market, so we interested in minimizes cost supply with energy. present greedy algorithm whose time complexity O ( T α ) where number intervals inverse Ackermann function.